A model of preference elicitation: The case of distributed resource allocation
نویسندگان
چکیده
Market mechanisms are deemed promising for distributed resource allocation settings by explicitly involving users into the allocation process. The market considers the users’ and providers’ valuations to generate efficient resource allocations and prices. In theory, valuations are assumed to be known to the user. In practice, however, this is not the case. It is a complex burden for both users and providers to assess their true valuation for a certain combination of resources and services and to efficiently communicate this valuation to the market. This paper contributes to the theory of designing distributed allocation models in that (i) we propose a model for preference elicitation, which allows users and providers to assess their valuations as a function of their resource requirements and strategic considerations, (ii) we show how this model can be encoded within so-called bidding agents which interact with the market on behalf of the user, and (iii) we evaluate our approach in a numerical experiment to illustrate how the bidding agent adapts to the dynamic market situation. As this evaluation shows, the model outperforms technical schedulers and can thus be used for decision support in electronic markets.
منابع مشابه
A Modular Framework for Multi-Agent Preference Elicitation
I present a framework for multi-agent preference elicitation in the context of a discrete resource-allocation problem, known as the combinatorial allocation problem (CAP). There are several distinct, indivisible items, which must be allocated among a set of agents. The agents value bundles rather than just individual items. Because the number of bundles can be very large, agent preferences cann...
متن کاملCase Mix Planning using The Technique for Order of Preference by Similarity to Ideal Solution and Robust Estimation: a Case Study
Management of surgery units and operating room (OR) play key roles in optimizing the utilization of hospitals. On this line Case Mix Planning (CMP) is normally applied to long term planning of OR. This refers to allocating OR time to each patient’s group. In this paper a mathematical model is applied to optimize the allocation of OR time among surgical groups. In addition, another technique is ...
متن کاملTowards Cooperative Negotiation for Decentralized Resource Allocation in Autonomic Computing Systems
Resource allocation is a key problem in autonomic computing. In this paper we use a data center scenario to motivate the need for decentralization and cooperative negotiation, and describe a promising approach that employs preference elicitation. 1 Resource Allocation in an Autonomic
متن کاملCentralized Cost Efficiency DEA Models
Cost efficiency measures the cost of resource by output production. While conventional cost efficiency models set targets separately for each DMU, There are cases where the Central decision making is seeking the above targets, and at the same tries to obtain the target of Min cost efficiency for the total consumption. in this paper we consider that there is a centralized decision maker (DM). In...
متن کاملResource re-allocation at network units by using of bi-level data envelopment analysis
The lack of renewable primary resources is one of the most serious challenges in recent decades. So under this circumstance, managers are looking for appropriate solutions for the optimal use of these resources to improve the efficiency of the under management units. One of the most widely used techniques in finding the optimal resource is data envelopment analysis (DEA). So in this paper, in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009